The Frequent Paucity of Trivial Strings
نویسنده
چکیده
A 1976 theorem of Chaitin can be used to show that arbitrarily dense sets of lengths n have a paucity of trivial strings (only a bounded number of strings of length n having trivially low plain Kolmogorov complexities). We use the probabilistic method to give a new proof of this fact. This proof is much simpler than previously published proofs, and it gives a tighter paucity bound.
منابع مشابه
Hand Injuries by the Killer Kite Manja and Their Management
Although hand injuries due to kite strings seem to be trivial, these injuries could be serious enough to lose the function of hand. This case series in the division of Plastic and Reconstructive Surgery of our institution from August 2014 to January 2016 evaluated the clinic-etiological profile, severity and management of hand injuries due to kite strings assessed clinically and radiologica...
متن کاملThe Analytic Technique and Experimental Research Methods of Post-buckling about Slender Rod Strings in Wellbore
The buckling behavior of rod strings in wellbore is one of the key issues in petroleum engineering. The slender rod strings in vertical wellbore were selected as research objects. Based on the energy method, the critical load formulas of sinusoidal and helical buckling were derived for the string with the bottom of the wellbore pressure. According to the sinusoidal and helical buckling’s geomet...
متن کاملA Fast and Accurate Global Maximum Power Point Tracking Method for Solar Strings under Partial Shading Conditions
This paper presents a model-based approach for the global maximum power point (GMPP) tracking of solar strings under partial shading conditions. In the proposed method, the GMPP voltage is estimated without any need to solve numerically the implicit and nonlinear equations of the photovoltaic (PV) string model. In contrast to the existing methods in which first the locations of all the local pe...
متن کاملScattering of Macroscopic Heterotic Strings
We show that macroscopic heterotic strings, formulated as strings which wind around a compact direction of finite but macroscopic extent, exhibit non-trivial scattering at low energies. This occurs at order velocity squared and may thus be described as geodesic motion on a moduli space with a non-trivial metric which we construct. Our result is in agreement with a direct calculation of the stri...
متن کاملHow Many Strings Are Easy to Predict?
It is well known in the theory of Kolmogorov complexity that most strings cannot be compressed; more precisely, only exponentially few (Θ(2n−m)) binary strings of length n can be compressed by m bits. This paper extends the ‘incompressibility’ property of Kolmogorov complexity to the ‘unpredictability’ property of predictive complexity. The ‘unpredictability’ property states that predictive com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 20 شماره
صفحات -
تاریخ انتشار 2013